#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<deque>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL c[maxn],d[maxn];
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  memset(c,-1,sizeof(c));memset(d,-1,sizeof(d));
  LL a,b,k;cin>>a>>b>>k;
  if(k==0){
    cout<<"Yes"<<"\n";
    for(LL i=1;i<=b;i++) c[i]=1;
    for(LL i=b+1;i<=a+b;i++) c[i]=0;
    for(LL i=1;i<=a+b;i++) cout<<c[i];
    cout<<"\n";
    for(LL i=1;i<=a+b;i++) cout<<c[i];
  }
  else if(b==1){
    cout<<"No"<<"\n";
  }
  else if(k>a+b-2){
    cout<<"No"<<"\n";
  }
  else{
     LL num0=a;LL num1=b;
     c[1]=d[1]=1;
     c[a+b]=0;d[a+b]=1;
     c[a+b-k]=1;d[a+b-k]=0;
     num0-=1;num1-=2;
     if(num0<0||num1<0){
        cout<<"No"<<"\n";return 0;
     }
     cout<<"Yes"<<"\n";
     for(LL i=1;i<=a+b;i++){
        if(c[i]==-1&&d[i]==-1){
            if(num1>0){
                num1--;
                c[i]=d[i]=1;
            }
            else if(num0>0){
                num0--;
                c[i]=d[i]=0;
            }
        }
     }
     for(LL i=1;i<=a+b;i++){
        cout<<c[i];
     }
     cout<<"\n";
     for(LL i=1;i<=a+b;i++){
        cout<<d[i];
     }
  }
return 0;
}
